A Novel Anti-Collision Scheduling Protocol for RFID-based Wireless Localization

نویسندگان

  • Wendong Xiao
  • Jaya Shankar Pathmasuntharam
چکیده

In an active RFID based wireless localization system, usually a number of RFID readers are required to generate localization beacon broadcasts from which a RFID tag can collect multiple RSSI measurements and forward them to a localization server for calculating the location of the tag. Such operations should be done from time to time when the tag is moving. Collisions may happen at the tag if the readers send the beacon broadcasts at the same time or at the server if the tags forward the measurements at the same time. In this paper, we present a novel hybrid slotted anti-collision scheduling protocol for such RFID-based wireless localization of mobile tags by considering tag mobility and treating the existing tags and newly entered tags differently. In the proposed protocol, a time frame consists of a reader beaconing phase, a sequential polling phase for existing tags, and a tree-splitting anti-collision measurement forwarding phase for newly entered tags. Because the existing tags do not participate in the third phase for competition, we are able to improve the time efficiency and the QoI (Quality of Information) of the localization. Analysis and simulation results verify the performance of the proposed protocols. Keywords—RFID; wireless localization; collision avoidance; tree-splitting algorithm; quality of information

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

منابع مشابه

A Novel Anti-Collision Protocol with Collision-Based Dynamic Clustering in Multiple-Reader RFID Systems

The Reader Collision Problem (RCP) is a bottle-neck decreasing the reading efficiency in multiplereader RFID systems. This paper proposed a novel anti-collision protocol – DRA (Distributed Reservation-based Anti-collision) protocol to solve the RCP in multiple-reader RFID systems. Temporal Cluster Headers (TCHs) are dynamically selected among the potentially interfered readers in DRA protocol. ...

متن کامل

An Anti-Collision protocol of RFID Based on Divide and Conquer Algorithm

Radio frequency identification (RFID) system is a wireless automatic identification mechanism. Now, it is widely applied in supply chain management, supermarket checkout process, public transportation, animal identification, the localization and tracking of objects and people, and toll ways. The tag collisions in RFID system is an unavoidable problem. The number of collision in previous tag ant...

متن کامل

A Novel and Efficient Anti-Collision Protocol for RFID Tag Identification

Radio frequency identification (RFID) is prominent technology for fast object identification and tracking. In RFID systems, reader-to-reader or tag-to-tag collisions are common. Majority of probabilistic and deterministic anticollisions methods are inefficient in channel distribution and improving the performance. In this work, simulation annealing based anti-collision protocol is proposed wher...

متن کامل

A Time - Optimal Anti - collision Algorithm for FSA - Based RFID Systems

© 2011 ETRI Journal, Volume 33, Number 3, June 2011 With the introduction of the new generation RFID technology, EPCglobal Class-1 Generation-2, there is considerable interest in improving the performance of the framed slotted Aloha (FSA)-based tag collision arbitration protocol. We suggest a novel time-optimal anti-collision algorithm for the FSA protocol. Our performance evaluation demonstrat...

متن کامل

Fast Capture - Recapture Approach for Mitigating the Problem of Missing RFID Tags

The technology of Radio Frequency IDentification (RFID) enables many applications that rely on passive, battery–less wireless devices. If a RFID reader needs to gather the ID from multiple tags in its range, then it needs to run an anti–collision protocol. Due to errors on the wireless link, a single reader session, which contains one full execution of the anti–collision protocol, may not be su...

متن کامل

ذخیره در منابع من


  با ذخیره ی این منبع در منابع من، دسترسی به آن را برای استفاده های بعدی آسان تر کنید

برای دانلود متن کامل این مقاله و بیش از 32 میلیون مقاله دیگر ابتدا ثبت نام کنید

ثبت نام

اگر عضو سایت هستید لطفا وارد حساب کاربری خود شوید

عنوان ژورنال:

دوره   شماره 

صفحات  -

تاریخ انتشار 2011